Multilevel Approaches for the Critical Node Problem
نویسندگان
چکیده
Multilevel programming can provide the right mathematical formulations for modeling sequential decision-making problems. In such cases, it is implicit that each level anticipates optimal reaction of subsequent ones. Defender–attacker–defender trilevel programs are a particular case interest encompasses fortification strategy, followed by an attack, and consequent recovery defensive strategy. “Multilevel Approaches Critical Node Problem,” Baggio, Carvalho, Lodi, Tramontani study combinatorial game between defender attacker takes place in network. The authors propose exact algorithmic framework. This work highlights significant improvements achieve taking three-stage into account instead considering as isolated. Simultaneously, paper contributes to advancing methodologies solving programs.
منابع مشابه
Multilevel Approaches for the Critical Node Problem
In recent years, a lot of effort has been dedicated to develop strategies to defend networks against possible cascade failures or malicious viral attacks. In particular, many results rely on two different viewpoints. On the one hand, network safety is investigated from a preventive perspective. In this paradigm, for a given network, the goal is to modify its structure, in order to minimize the ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMonodromy problem for the degenerate critical points
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...
متن کاملHybrid constructive heuristics for the critical node problem
We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple “hybrid” heuristic algorithm. The obtained algorithms are shown to be...
متن کاملMultilevel Approaches applied to the Capacitated Clustering Problem
This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2021
ISSN: ['1526-5463', '0030-364X']
DOI: https://doi.org/10.1287/opre.2020.2014